Constructing elliptic curves of prescribed order

Dit proefschrift gaat over algoritmen in de getaltheorie. Het woord algoritme is een verbastering van de naam van de Perzische wiskundige Muhammad ibn Musa al-Khwarizmi (790-850)UBL - phd migration 201

On the random neighbor Olami-Feder-Christensen slip-stick model

We reconsider the treatment of Lise and Jensen (Phys. Rev. Lett. 76, 2326 (1996)) on the random neighbor Olami-Feder-Christensen stik-slip model, and examine the strong dependence of the results on the approximations used for the distribution of states p(E).Comment: 6pages, 3 figures. To be published in PRE as a brief repor

Random Neighbor Theory of the Olami-Feder-Christensen Earthquake Model

We derive the exact equations of motion for the random neighbor version of the Olami-Feder-Christensen earthquake model in the infinite-size limit. We solve them numerically, and compare with simulations of the model for large numbers of sites. We find perfect agreement. But we do not find any scaling or phase transitions, except in the conservative limit. This is in contradiction to claims by Lise & Jensen (Phys. Rev. Lett. 76, 2326 (1996)) based on approximate solutions of the same model. It indicates again that scaling in the Olami-Feder-Christensen model is only due to partial synchronization driven by spatial inhomogeneities. Finally, we point out that our method can be used also for other SOC models, and treat in detail the random neighbor version of the Feder-Feder model.Comment: 18 pages, 6 ps-figures included; minor correction in sec.

Equivalence of stationary state ensembles

We show that the contact process in an ensemble with conserved total particle number, as simulated recently by Tome and de Oliveira [Phys. Rev. Lett. 86 (2001) 5463], is equivalent to the ordinary contact process, in agreement with what the authors assumed and believed. Similar conserved ensembles and equivalence proofs are easily constructed for other models.Comment: 5 pages, no figure

Robust Dropping Criteria for F-norm Minimization Based Sparse Approximate Inverse Preconditioning

Dropping tolerance criteria play a central role in Sparse Approximate Inverse preconditioning. Such criteria have received, however, little attention and have been treated heuristically in the following manner: If the size of an entry is below some empirically small positive quantity, then it is set to zero. The meaning of "small" is vague and has not been considered rigorously. It has not been clear how dropping tolerances affect the quality and effectiveness of a preconditioner $M$. In this paper, we focus on the adaptive Power Sparse Approximate Inverse algorithm and establish a mathematical theory on robust selection criteria for dropping tolerances. Using the theory, we derive an adaptive dropping criterion that is used to drop entries of small magnitude dynamically during the setup process of $M$. The proposed criterion enables us to make $M$ both as sparse as possible as well as to be of comparable quality to the potentially denser matrix which is obtained without dropping. As a byproduct, the theory applies to static F-norm minimization based preconditioning procedures, and a similar dropping criterion is given that can be used to sparsify a matrix after it has been computed by a static sparse approximate inverse procedure. In contrast to the adaptive procedure, dropping in the static procedure does not reduce the setup time of the matrix but makes the application of the sparser $M$ for Krylov iterations cheaper. Numerical experiments reported confirm the theory and illustrate the robustness and effectiveness of the dropping criteria.Comment: 27 pages, 2 figure

On the robustness of scale invariance in SOC models

A random neighbor extremal stick-slip model is introduced. In the thermodynamic limit, the distribution of states has a simple analytical form and the mean avalanche size, as a function of the coupling parameter, is exactly calculable. The system is critical only at a special point Jc in the coupling parameter space. However, the critical region around this point, where approximate scale invariance holds, is very large, suggesting a mechanism for explaining the ubiquity of scale invariance in Nature.Comment: 6 pages, 4 figures; submitted to Physical Review E; http://link.aps.org/doi/10.1103/PhysRevE.59.496

Rational isogenies from irrational endomorphisms

In this paper, we introduce a polynomial-time algorithm to compute a connecting $\mathcal{O}$-ideal between two supersingular elliptic curves over $\mathbb{F}_p$ with common $\mathbb{F}_p$-endomorphism ring $\mathcal{O}$, given a description of their full endomorphism rings. This algorithm provides a reduction of the security of the CSIDH cryptosystem to the problem of computing endomorphism rings of supersingular elliptic curves. A similar reduction for SIDH appeared at Asiacrypt 2016, but relies on totally different techniques. Furthermore, we also show that any supersingular elliptic curve constructed using the complex-multiplication method can be located precisely in the supersingular isogeny graph by explicitly deriving a path to a known base curve. This result prohibits the use of such curves as a building block for a hash function into the supersingular isogeny graph

Cracking Piles of Brittle Grains

A model which accounts for cracking avalanches in piles of grains subject to external load is introduced and numerically simulated. The stress is stochastically transferred from higher layers to lower ones. Cracked areas exhibit various morphologies, depending on the degree of randomness in the packing and on the ductility of the grains. The external force necessary to continue the cracking process is constant in wide range of values of the fraction of already cracked grains. If the grains are very brittle, the force fluctuations become periodic in early stages of cracking. Distribution of cracking avalanches obeys a power law with exponent $\tau = 2.4 \pm 0.1$.Comment: RevTeX, 6 pages, 7 postscript figures, submitted to Phys. Rev.